A characterization of rational amalgamation operations
نویسندگان
چکیده
منابع مشابه
A characterization of rational amalgamation operations
This paper deals with amalgamation of fuzzy opinions when a fixed number of individuals is faced with an unknown number of alternatives. The aggregation rule is defined by means of intensity aggregation operations that verify certain ethical conditions, and assuming fuzzy rationality as defined in [1, 2]. A necessary and sufficient condition for non-irrationality is presented, along with commen...
متن کاملCombination of Constraint Systems II: Rational Amalgamation
38 and the rich amount of interesting relationships between them, are now well-understood (e.g., Co83, Ma88]). We believe that free amalgamation, rational amalgamation and a further construction called \innnite amalgamation" (still to be investigated) reeect this role on the higher level of amalgamation constructions. Many of the results that we have obtained for free and rational amalgamation ...
متن کاملA Study on Unique Rational Operations
For each basic language operation we define its “unique” counterpart as being the operation which results in a language whose words can be obtain uniquely through the given operation. As shown in the preliminaries of this paper, these unique operations can arguably be viewed as combined basic operations, placing this work in the popular area of state complexity of combined language operations. ...
متن کاملA Characterization of Rational Singularities
Themain purpose of this note is to present a characterization of rational singularities in characteristic 0. The essence of the characterization is that it is enough to require less than the usual definition. Theorem 1. Let φ : Y → X be a morphism of varieties over C, and let ρ : X → Rφ∗ Y be the associated natural morphism. Assume that Y has rational singularities and there exists a morphism (...
متن کاملState complexity of unique rational operations
For eachbasic language operationwedefine its ‘‘unique’’ counterpart as being the operation that results in a language whose words can be obtained uniquely through the given operation. These unique operations can arguably be viewed as combined basic operations, placing thiswork in the popular area of state complexity of combined operations on regular languages. We study the state complexity of u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Approximate Reasoning
سال: 1993
ISSN: 0888-613X
DOI: 10.1016/0888-613x(93)90028-c